End Conditions for Interpolatory Quintic Splines
نویسندگان
چکیده
منابع مشابه
Some smoothness conditions and conformality conditions for bivariate quartic and quintic splines
This paper is concerned with a study of some new formulations of smoothness conditions and conformality conditions for multivariate splines in terms of B-net representation. In the bivariate setting, a group of new parameters of bivariate quartic and quintic polynomials over a planar simplex is introduced, new formulations of smoothness conditions of bivariate quartic C1 splines and quintic C2 ...
متن کاملQuasi-interpolatory splines based on Schoenberg points
By using the Schoenberg points as quasi-interpolatory points, we achieve both generality and economy in contrast to previous sets, which achieve either generality or economy, but not both. The price we pay is a more complicated theory and weaker error bounds, although the order of convergence is unchanged. Applications to numerical integration are given and numerical examples show that the accu...
متن کاملNon-uniform interpolatory subdivision via splines
We present a framework for deriving non-uniform interpolatory subdivision algorithms closely related to non-uniform spline interpolants. Families of symmetric non-uniform interpolatory 2n-point schemes of smoothness C are presented for n = 2, 3, 4 and even higher order, as well as a variety of non-uniform 6-point schemes with C continuity.
متن کاملTernary interpolatory Subdivision Schemes Originated from splines
A generic technique for construction of ternary interpolatory subdivision schemes, which is based on polynomial and discrete splines, is presented. These schemes have rational symbols. The symbols are explicitly presented in the paper. This is accompanied by a detailed description of the design of the refinement masks and by algorithms that verify the convergence of these schemes. In addition, ...
متن کاملComputation of interpolatory splines via triadic subdivision
We present an algorithm for computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit expressions for the subdivision symbols are established. These are rational functions. The computations are implemented by recursive filtering.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Numerical Analysis
سال: 1981
ISSN: 0272-4979,1464-3642
DOI: 10.1093/imanum/1.1.81